Polyominoes with minimum site-perimeter and full set achievement games
نویسنده
چکیده
The site-perimeter of a polyomino is the number of empty cells connected to the polyomino by an edge. A formula for the minimum site-perimeter with a given cell size is found. This formula is used to show the effectiveness of a simple random strategy in polyomino set achievement games.
منابع مشابه
Polyiamonds and Polyhexes with Minimum Site-Perimeter and Achievement Games
An animal is an edge connected set of nitely many cells of a regular tiling of the plane. The site-perimeter of an animal is the number of empty cells connected to the animal by an edge. The minimum site-perimeter with a given cell size is found for animals on the triangular and hexagonal grid. The formulas are used to show the e ectiveness of a simple random strategy in full set animal achieve...
متن کاملRectangular polyomino set weak (1, 2)-achievement games
In a polyomino set (1,2)-achievement game the maker and the breaker alternately mark one and two previously unmarked cells respectively. The maker's goal is to mark a set of cells congruent to one of a given set of polyominoes. The breaker tries to prevent the maker from achieving his goal. The teams of polyominoes for which the maker has a winning strategy is determined up to size 4. In set ac...
متن کاملCounting polyominoes with minimum perimeter
The number of essentially different square polyominoes of order n and minimum perimeter p(n) is enumerated.
متن کاملThe Site Perimeter of Bargraphs
The site perimeter enumeration of polyominoes that are both columnand row-convex is a well-understood problem that always yields algebraic generating functions. Counting more general families of polyominoes is a far more difficult problem. Here Mireille BousquetMélou and Andrew Rechnitzer enumerate (by their site perimeter) the simplest family of polyominoes that are not fully convex—bargraphs....
متن کامل0 Statistics of lattice animals ( polyominoes ) and polygons
We have developed an improved algorithm that allows us to enumerate the number of site animals (polyominoes) on the square lattice up to size 46. Analysis of the resulting series yields an improved estimate, τ = 4.062570(8), for the growth constant of lattice animals and confirms to a very high degree of certainty that the generating function has a logarithmic divergence. We prove the bound τ >...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 29 شماره
صفحات -
تاریخ انتشار 2008